منابع مشابه
A Family of Incomplete Relational Database Models
In this paper. we utilize intervals for unknown values in incomplete relational databases. We use tables to represent unknown relations. First, we define three partial tuple types in a table to specify incompleteness relationships among tuples of the same table. For tuples of different tables, we distinguish between the cases where incompleteness are introduced at the relation level, tuple leve...
متن کاملFunctional Dependencies Analyse in Fuzzy Relational Database Models
This paper presents a literature overview of Fuzzy Relational Database Models with emphasis on the role of functional dependencies in logical designing and modeling. The aim is the analysis of recent results in this fi eld. Fuzzy set theory is widely applied for the classical relational database extensions resulting in numerous contributions. This is because fuzzy sets and fuzzy logic are power...
متن کاملCompiling Relational Database Schemata into Probabilistic Graphical Models
A majority of scientific and commercial data is stored in relational databases. Probabilistic models over such datasets would allow probabilistic queries, error checking, and inference of missing values, but to this day machine learning expertise is required to construct accurate models. Fortunately, current probabilistic programming tools ease the task of constructing such models [1, 2, 3, 4, ...
متن کاملRelational Models for Tabling Logic Programs in a Database
Resolution strategies based on tabling are considered to be particularly effective in Logic Programming. Unfortunately, when faced with applications that compute large and/or many answers, memory exhaustion is a potential problem. In such cases, table deletion is the most common approach to recover space. In this work, we propose a different approach, storing tables into a relational database. ...
متن کاملInfinite mixtures for multi-relational categorical data
Large relational datasets are prevalent in many fields. We propose an unsupervised component model for relational data, i.e., for heterogeneous collections of categorical co-occurrences. The co-occurrences can be dyadic or n-adic, and over the same or different categorical variables. Graphs are a special case, as collections of dyadic cooccurrences (edges) over a set of vertices. The model is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1984
ISSN: 0286-522X
DOI: 10.5109/13360